package top.lyc829.leetcode.T172;

import java.math.BigInteger;

public class Solution {
    public int trailingZeroes(int n) {
        int count = 0;
        while (n > 0) {
            n /= 5;
            count += n;
        }
        return count;
    }


    public static void main(String[] args) {
        Solution s = new Solution();
        int res = s.trailingZeroes(13);
        System.out.println(res);
    }

}
